Pursuit-evasion in medium-range air-combat scenarios
نویسندگان
چکیده
منابع مشابه
A Near Optimal Fuzzy Modeling of pursuit-evasion in an Air Combat
We propose a new method for a near optimal three-dimensional fuzzy modeling of pursuit-evasion in an air combat in this paper. A sixth order nonlinear point mass vehicle model is considered for an aircraft's flight dynamics. The desired value of the velocity, the flight path and the heading angles are obtained from some rule bases. The physical control parameters are computed through a mean squ...
متن کاملA Solution of Missile-aircraft Pursuit-evasion Differential Games in Medium Range
This paper shows a method to obtain the exact solution for a missile and an aircraft differential games which minimizes and maximizes the essential pay-off of the problem: the miss distance, without employing any linearized approximation. For this purpose, we introduced the concept of energy maneuverability. Once the families of optimal terminal surfaces are obtained, the proposed method can so...
متن کاملACTIVE BEHAVIOR RECOGNITION IN BVR AIR COMBAT Active Behavior Recognition in Beyond Visual Range Air Combat
Accurately modeling uncontrolled agents (or recognizing their behavior and intentions) is critical to planning and acting in a multi-agent environment. However, behavior recognition systems are only as good as their observations. Here we argue that acting, even acting at random, can be a critical part of gathering those observations. Furthermore, we claim that acting intelligently via automated...
متن کاملA medium-range air combat game solution by a pilot advisory system
Air-to-air combat between two aggressive aircraft , both equipped with medium-range guided missiles, is .a key element of future air warfare. This dynamic coni lict can be viewed as an interaction of a twotarget diiferential game (between the air-craft) and two independent missileaircraft pursuit-evasion games. The information structure is, however, rather intricate: though perfect information ...
متن کاملPursuit- Evasion Games
Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1987
ISSN: 0898-1221
DOI: 10.1016/0898-1221(87)90102-7